An Observation of Dynamic Programming with Set-valued Translate Maps by Using Some Duality Formulations
نویسندگان
چکیده
A dynamic programming problem that each state at some stage is chosen from a set decided by the state and action at the last stage, in other words, translate maps are set-valued maps, is considered and investigated. To solve the problem, two roles of choice of next stage are introduced; one is to the player’s advantage, and the other is disadvangate. Also, two duality formulations based on Fenchel-Rockafellar duality [7] and Kanniappan duality [6] for such dynamic programming problem are defined and observed.
منابع مشابه
Entropy of a semigroup of maps from a set-valued view
In this paper, we introduce a new entropy-like invariant, named Hausdorff metric entropy, for finitely generated semigroups acting on compact metric spaces from a set-valued view and study its properties. We establish the relation between Hausdorff metric entropy and topological entropy of a semigroup defined by Bis. Some examples with positive or zero Hausdorff metric entropy are given. Moreov...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملBest proximity pair and coincidence point theorems for nonexpansive set-valued maps in Hilbert spaces
This paper is concerned with the best proximity pair problem in Hilbert spaces. Given two subsets $A$ and $B$ of a Hilbert space $H$ and the set-valued maps $F:A o 2^ B$ and $G:A_0 o 2^{A_0}$, where $A_0={xin A: |x-y|=d(A,B)~~~mbox{for some}~~~ yin B}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in A$ such that $$d(G(x_0),F(x_0))=d(A,B).$$
متن کاملA generalization of the Chen-Wu duality into quantale-valued setting
With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...
متن کاملSome Duality Results in Grey Linear Programming Problem
Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...
متن کامل